Informatics Publishing Limited

K. S. Suresh ¹, V. Vaithiyanathan ¹, S. Venugopal ²

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401 Tamil Nadu, IN
2 Indira Gandhi Centre for Atomic Research, Kalpakkam - 603102, Tamil Nadu, IN

Abstract

Travelling Salesman Problem (TSP) is a very old problem which has been solved in so many methodologies. The solution for the Robot Path Planning (RPP) can be derived using the methodologies used for the TSP. In this paper, Genetic Algorithm (GA) principle is employed to solve the TSP and is mapped to solve the RPP with the same principle. The both problems are defined to observe similarity between these problems and enumerated the conversion phases. In these two cases how the solutions are to be derived to implement the GA technique to accomplish the optimal path in both cases and tested for different number of cities, population space and generations. The minimum cost and mean cost of the solution space proves its giving the optimal result

Keywords

ASCII, Encryption, Hackers, Random Number, Symmetric Key

Full Text

   

K. S. Suresh ¹, V. Vaithiyanathan ¹, S. Venugopal ²

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 Indira Gandhi Centre for Atomic Research, Kalpakkam - 603102, Tamil Nadu, IN

Abstract

Robot Path Planning (RPP) is solved using Genetic Algorithm (GA) principle for collision-free navigation for the three dimensional static space to find the optimal path. In this paper, Layered Approach is employed where the whole three dimensional space is considered as layers of two dimensional spaces to accomplish the RPP to reach the target by avoiding obstacles and find the shortest path. The quality of the path is ensured by nearest neighbourhood approach. Implementation of the principle of GA to solve RPP is effective where the environment contains huge number of solution paths compared to the classical methods to obtain the shortest path from source to target. This approach is tested for different number of layers and the results are tabled. The path generated and optimal path obtained by the implementation of this approach has been compared with the cost of the optimal path obtained manually.

Keywords

Collision-Free, Genetic Algorithm, Robot Path Planning, Three Dimensional Spaces

Full Text

   

Kataru Venkata Kavya ¹, K. S. Suresh ², A. Umamakeswari ²

Affiliations
1 Embedded Systems, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

Objective: Today, the field of versatile mechanical tele presence is in fast development, with an expanding measure of business frameworks and quick extensions. Methods: There are two techniques to control the robot in which one is a wired and the other is wireless. Customarily, they are called as LAN and IOT. An advanced mobile phone individual hotspot is used to control and screen the robot. Consequently, the Raspberry Pi board and PC are associated with advanced mobile phone. Findings: With a specific end goal to upgrade the client's capacity to remotely convey, control and feel present in a remote domain, the emphasis is more on 1. Semi-independent robot control 2. Situation mindfulness by ongoing face identification 3. People following or individual’s collaboration along these lines utilizing Raspberry Pi model B as a part of which a robot is controlled through wired innovation and web of things which has boundless scope territory and the robot can be controlled more than a few million kilometers furthermore offloads some calculation on the cloud. Applications: The clients may be able to influence remote regions such that the robot position, activities, developments and so forth are detected, and transmitted.

Keywords

A Semiautonomous Telepresence Mobile Robot, Controlling and Real Time Detection, Internet of Things, Security Surveillance.

Full Text